Monitoring of zero-inflated Poisson processes with EWMA and DEWMA control charts

The zero-inflated Poisson (ZIP) distribution is an extension of the ordinary Poisson distribution and is used to model count data with an excessive number of zeros. In ZIP models, it is assumed that random shocks occur with probability p, and upon the occurrence of random shock, the number of nonconformities in a product follows the Poisson distribution with parameter λ. In this article, we study in more detail the exponentially weighted moving average control chart based on the ZIP distribution (regarded as ZIP-EWMA) and we also propose a double EWMA chart with an upper time-varying control limit to monitor ZIP processes (regarded as ZIP-DEWMA chart). The two charts are studied to detect upward shifts not only in each parameter individually but also in both parameters simultaneously. The steady-state performance and the performance with estimated parameters are also investigated. The performance of the two charts has been evaluated in terms of the average and standard deviation of the run length, and compared with Shewhart-type and CUSUM schemes for ZIP distribution, it is shown that the proposed chart is very effective especially in detecting shifts in p when λ remains in control (IC) and in both parameters simultaneously. Finally, one real example is given to display the application of the ZIP charts on practitioners.     

The SAINT observatory subsystem: an open-source intelligence tool for uncovering cybersecurity threats

International Journal of Information Security - Data from Online Social Networks, search engines, and the World Wide Web are forms of unstructured knowledge that are not regularly used in...     

Estimating spine shape in lateral sleep positions using silhouette-derived body shape models

This study aims at evaluating spinal alignment during sleep by combining personalized human models with mattress indentation measurements. A generic surface model has been developed that can be personalized based on anthropometric parameters derived from silhouette extraction. Shape assessment of the personalized surface models, performed by comparison with 3-D surface scans of the trunk, showed a mean unsigned distance of 9.77 mm between modeled and scanned surface meshes. The surface model is combined with an inner skeleton model, allowing the model to simulate distinct sleep postures. An automatic fitting algorithm sets the appropriate degrees of freedom to position the model on the measured indentation according to the adopted sleep posture. Validation on lateral sleep positions showed good intraclass correlations (0.73–0.88) between estimated and measured angular spinal deformations, indicating that silhouette-derived body shape models provide a valuable tool for the unobtrusive assessment of spinal alignment during sleep.Relevance to industry: A common drawback of the available techniques to assess spinal deformation on bedding systems is that they interfere with the actual sleep process. The current study presents a novel method based on silhouette-derived body shape models in order to estimate spine shape during sleep unobtrusively.     

Optimizations of the naïve-Bayes classifier for the prognosis of B-Chronic Lymphocytic Leukemia incorporating flow cytometry data

Prognosis of B-Chronic Lymphocytic Leukemia (B-CLL) remains a challenging problem in medical research and practice. While the parameters obtained by flow cytometry analysis form the basis of the diagnosis of the disease, the question whether these parameters offer additional prognostic information still remains open. In this work, we attempt to provide computer-assisted support to the clinical experts of the field, by deploying a classification system for B-CLL multiparametric prognosis that combines various heterogeneous (clinical, laboratory and flow cytometry) parameters associated with the disease. For this purpose, we employ the na?ve-Bayes classifier and propose an algorithm that improves its performance. The algorithm discretizes the continuous classification attributes (candidate prognostic parameters) and selects the most useful subset of them to optimize the classification accuracy. Thus, in addition to the high classification accuracy achieved, the proposed approach also suggests the most informative parameters for the prognosis. The experimental results demonstrate that the inclusion of flow cytometry parameters in our system improves prognosis.     

On using reservoir computing for sensing applications: exploring environment-sensitive memristor networks

Abstract

Recently, the SWEET sensing setup has been proposed as a way of exploiting reservoir computing for sensing. The setup features three components: an input signal (the drive), the environment and a reservoir, where the reservoir and the environment are treated as one dynamical system, a super-reservoir. Due to the reservoir-environment interaction, the information about the environment is encoded in the state of the reservoir. This information can be inferred (decoded) by analysing the reservoir state. The decoding is done by using an external drive signal. This signal is optimised to achieve a separation in the space of the reservoir states: Under different environmental conditions, the reservoir should visit distinct regions of the configuration space. We examined this approach theoretically by using an environment-sensitive memristor as a reservoir, where the memristance is the state variable. The goal has been to identify a suitable drive that can achieve the phase space separation, which was formulated as an optimization problem, and solved by a genetic optimization algorithm developed in this study. For simplicity reasons, only two environmental conditions were considered (describing a static and a varying environment). A suitable drive signal has been identified based on intuitive analysis of the memristor dynamics, and by solving the optimization problem. Under both drives the memristance is driven to two different regions of the one-dimensional state space under the influence of the two environmental conditions, which can be used to infer about the environment. The separation occurs if there is a synchronisation between the drive and the environmental signals. To quantify the magnitude of the separation, we introduced a quality of sensing index: The ability to sense depends critically on the synchronisation between the drive and environmental conditions. If this synchronisation is not maintained the quality of sensing deteriorates.     

A Multiagent Platform for Ubiquitous Service Provision

The Virtual Home Environment is very important in contemporary mobile telecommunications infrastructure as it caters for the ubiquitous provision of services irrespective of network, location and user device. The universality of systems like Universal Mobile Telecommunications System and wi-fi increases the need for the rapid introduction of efficient VHE schemes. In this paper, we study the adoption of Mobile Agents for handling the VHE functionality. Mobile agents are nicely harmonized with the broader idea of VHE as they allow the autonomous execution of tasks by components that roam from node to node and network to network. We present the detailed modeling of a VHE provisioning architecture and investigate its suitability for different use cases and technical options (e.g., end user devices). The adoption of mobile agents for the ubiquitous provision of telecommunication services is quite promising in terms of efficiency. Through a series of experiments we quantify the performance benefits stemming from the adoption of mobile agents in contrast to conventional service provisioning schemes.     

Multiscale quality assessment of Global Human Settlement Layer scenes against reference data using statistical learning

A method for quality assessment of the Global Human Settlement Layer scenes against reference data is presented. It relies on two settlement metrics; the local average and gradient functions that quantify the notions of settlement density and flexible settlement limits respectively. They are both utilized as generalization functions for increasing the level of abstraction of the sets under comparison. Generalization compensates for inaccuracies of the automatic target extraction method and can be computed at multiple scales. The comparison between the target built-up layers and the reference data employs an ordered multi-scale, linear regression computing the goodness of fit measure R²$R^2$. An optimized assessment procedure is investigated in a pilot study and is further employed in a big data exercise. A newly introduced quality metric returns the agreement between automatically extracted built-up from a set of 13605 scenes and the MODIS 500 urban layer, that was found too be as high as 91% for selected sensors. A final experiment attempts a performance increase at lower scales by correlating the target layer with automatically selected training subsets. At 50 m the adjusted R²$R^2$ increases by 3% with a mean squared error improvement of 2% compared to the performance achieved without statistical learning. The experiment suggests that the GHSL assessment at a global scale can be carried out based on limited high resolution reference data of minimal spatial coverage.     

The Weibull manifold in low-level image processing: An application to automatic image focusing

In this paper, we introduce a novel framework for low-level image processing and analysis. First, we process images with very simple, difference-based filter functions. Second, we fit the 2-parameter Weibull distribution to the filtered output. This maps each image to the 2D Weibull manifold. Third, we exploit the information geometry of this manifold and solve low-level image processing tasks as minimisation problems on point sets. For a proof-of-concept example, we examine the image autofocusing task. We propose appropriate cost functions together with a simple implicitly-constrained manifold optimisation algorithm and show that our framework compares very favourably against common autofocus methods from literature. In particular, our approach exhibits the best overall performance in terms of combined speed and accuracy.     

Multi-objective performance optimisation for model predictive control by goal attainment

This article proposes an approach for performance tuning of model predictive control (MPC) using goal-attainment optimisation of the cost function weighting matrices. The approach is developed for three formulations of the control problem: (i) minimal and (ii) non-minimal design based on the same cost function and (iii) a non-minimal MPC approach with an explicit integral-of-error state variable and modified cost function. This approach is based on earlier research into multi-objective optimisation for proportional-integral-plus control systems. Simulation experiments for a 3-input, 3-output Shell heavy oil fractionator model illustrate the feasibility of MPC goal attainment for multivariable decoupling and attainment of a specific output response. For this example, the integral-of-error state variable offers improved design flexibility and hence, when it is combined with the proposed tuning method, yields an improved closed-loop response in comparison to minimal MPC.     

Statistical Analysis and Modeling of Jobs in a Grid Environment

The existence of good probabilistic models for the job arrival process and the delay components introduced at different stages of job processing in a Grid environment is important for the improved understanding of the Grid computing concept. In this study, we present a thorough analysis of the job arrival process in the EGEE infrastructure and of the time durations a job spends at different states in the EGEE environment. We define four delay components of the total job delay and model each component separately. We observe that the job inter-arrival times at the Grid level can be adequately modelled by a rounded exponential distribution, while the total job delay (from the time it is generated until the time it completes execution) is dominated by the computing element’s register and queuing times and the worker node’s execution times. Further, we evaluate the efficiency of the EGEE environment by comparing the job total delay performance with that of a hypothetical ideal super-cluster and conclude that we would obtain similar performance if we submitted the same workload to a super-cluster of size equal to 34% of the total average number of CPUs participating in the EGEE infrastructure. We also analyze the job inter-arrival times, the CE’s queuing times, the WN’s execution times, and the data sizes exchanged at the kallisto.hellasgrid.gr cluster, which is node in the EGEE infrastructure. In contrast to the Grid level, we find that at the cluster level the job arrival process exhibits self-similarity/long-range dependence. Finally, we propose simple and intuitive models for the job arrival process and the execution times at the cluster level.